Variable-step preconditioned conjugate gradient method for partial symmetric eigenvalue problems
نویسندگان
چکیده
in which A is a large sparse symmetric positive definite matrix, λ is an eigenvalue and u is a corresponding eigenvector. The evaluation of one or more smallest eigenpairs has much practical interest for describing the characteristics of physical phenomena. For example, smallest eigenvalues characterize the base frequences of vibrating mechanical structures. Typically, the matrix A is a discretization matrix, arising as a result of finite-difference, finite element or finite volume discretization of elliptic boundary value problems with self-adjoint differential operators on a mesh with a characteristic meshsize h, which has n real positive eigenvalues
منابع مشابه
Efficient Solution of Symmetric Eigenvalue Problems Using Multigrid Preconditioners in the Locally Optimal Block Conjugate Gradient Method
We present a short survey of multigrid–based solvers for symmetric eigenvalue problems. We concentrate our attention on “of the shelf” and “black box” methods, which should allow solving eigenvalue problems with minimal, or no, effort on the part of the developer, taking advantage of already existing algorithms and software. We consider a class of such methods, where the multigrid only appears ...
متن کاملA geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
In two previous papers by Neymeyr: A geometric theory for preconditioned inverse iteration I: Extrema of the Rayleigh quotient, LAA 322: (1-3), 61-85, 2001, and A geometric theory for preconditioned inverse iteration II: Convergence estimates, LAA 322: (1-3), 87-104, 2001, a sharp, but cumbersome, convergence rate estimate was proved for a simple preconditioned eigensolver, which computes the s...
متن کاملPreconditioned Techniques for Large Eigenvalue Problems a Thesis Submitted to the Faculty of the Graduate School of the University of Minnesota by Kesheng Wu in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
This research focuses on nding a large number of eigenvalues and eigenvectors of a sparse symmetric or Hermitian matrix, for example, nding 1000 eigenpairs of a 100,000 100,000 matrix. These eigenvalue problems are challenging because the matrix size is too large for traditional QR based algorithms and the number of desired eigenpairs is too large for most common sparse eigenvalue algorithms. I...
متن کاملA preconditioned block conjugate gradient algorithm for computing extreme eigenpairs of symmetric and Hermitian problems
This report describes an algorithm for the efficient computation of several extreme eigenvalues and corresponding eigenvectors of a large-scale standard or generalized real symmetric or complex Hermitian eigenvalue problem. The main features are: (i) a new conjugate gradient scheme specifically designed for eigenvalue computation; (ii) the use of the preconditioning as a cheaper alternative to ...
متن کاملBlock Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in hypre and PETSc
We describe our software package Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) publicly released recently. BLOPEX is available as a stand-alone serial library, as an external package to PETSc (“Portable, Extensible Toolkit for Scientific Computation”, a general purpose suite of tools for the scalable solution of partial differential equations and related problems developed by...
متن کامل